Diameter and Treewidth in Minor-Closed Graph Families
نویسندگان
چکیده
منابع مشابه
Densities of Minor-Closed Graph Families
We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities. This set of numbers is countable, well-ordered, and closed; its order type is at least ωω. It is the closure of the set of densities of density-minimal graphs...
متن کاملComputing Graph Distances Parameterized by Treewidth and Diameter
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed in time n expO(k log d), where k is the treewidth of the graph and d is the diameter. This means that the diameter and the radius of the graph can be computed in the same time. In particular, if the diameter is constant, it can be determined in time n expO(k). This result matches a recent hardness...
متن کاملProper minor-closed families are small
We prove that for every proper minor-closed class I of graphs there exists a constant c such that for every integer n the class I includes at most n!c graphs with vertex-set {1, 2, . . . , n}. This answers a question of Welsh.
متن کاملPacking minor closed families of graphs
Motivated by a conjecture of Gyárfás, recently Böttcher, Hladký, Piguet, and Taraz showed that every collection T1, . . . , Tn of trees on n vertices with ∑n i=1 e(Ti) ≤ ( n 2 ) and with bounded maximum degree, can be packed into the complete graph on (1 + o(1))n vertices. We generalize this result where we relax the restriction of packing families of trees to families of graphs of any given no...
متن کاملSquare Roots of Minor Closed Graph Classes
Let G be a graph class. The square root of G contains all graphs whose square belong in G. We prove that if G is non-trivial and minor closed, then all graphs in its square root have carving-width bounded by some constant depending only on G. As a consequence, every square root of such a graph class has a linear time recognition algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2000
ISSN: 0178-4617
DOI: 10.1007/s004530010020